NONBLOCKER: Parameterized Algorithmics for minimum dominating set
نویسندگان
چکیده
We provide parameterized algorithms for nonblocker, the parametric dual of the well known dominating set problem. We exemplify three methodologies for deriving parameterized algorithms that can be used in other circumstances as well, including the (i) use of extremal combinatorics (known results from graph theory) in order to obtain very small kernels, (ii) use of known exact algorithms for the (nonparameterized) minimum dominating set problem, and (iii) use of exponential space. Parameterized by the size kd of the non-blocking set, we obtain an algorithm that runs in time O∗(1.4123kd) when allowing exponential space.
منابع مشابه
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs
We present a linear-time kernelization algorithm that transforms a given planar graph G with domination number γ(G) into a planar graph G′ of size O(γ(G)) with γ(G) = γ(G′). In addition, a minimum dominating set for G can be inferred from a minimum dominating set for G′. In terms of parameterized algorithmics, this implies a linear-size problem kernel for the NP-hard Dominating Set problem on p...
متن کاملNonblocker in H-Minor Free Graphs: Kernelization Meets Discharging
Perhaps the best known kernelization result is the kernel of size 335k for the Planar Dominating Set problem by Alber et al. [1], later improved to 67k by Chen et al. [5]. This result means roughly, that the problem of finding the smallest dominating set in a planar graph is easy when the optimal solution is small. On the other hand, it is known that Planar Dominating Set parameterized by k = |...
متن کاملKernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
In the Hitting Set problem, we are given a collection F of subsets of a ground set V and an integer p, and asked whether V has a p-element subset that intersects each set in F . We consider two parameterizations of Hitting Set below tight upper bounds: p = m − k and p = n − k. In both cases k is the parameter. We prove that the first parameterization is fixed-parameter tractable, but has no pol...
متن کاملCoordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a significantly improved FPT algorithm for the Maximum Leaf Spanning Tree problem. Furthermore, we sketch how the methods can be applied to a number of other well-known problems, including the parametric dual of Dominating Set (also known as Nonblocker), Matri...
متن کاملA Parameterized Route to Exact Puzzles: Breaking the 2-Barrier for irredundance
The lower and the upper irredundance numbers of a graph G, denoted ir(G) and IR(G) respectively, are conceptually linked to domination and independence numbers and have numerous relations to other graph parameters. It is a long-standing open question whether determining these numbers for a graph G on n vertices admits exact algorithms running in time less than the trivial Ω(2) enumeration barri...
متن کامل